Study on Binary Equivalent Decimal Edge Graceful Labeling

Edge Odd Graceful Labeling for Different Paths using Padavon Sequence

The even graceful labeling of a graph G with q edges means that there is an injection f : V(G) to { 0,1,1,1,2,...,2q+i/i= 1 to n} such that when each edge uv is assigned the label |f(u) – f(v)| the resulting edge labels are {1,3,5,...,2q-1}. A graph which admits an edge odd graceful labeling is called an edge-odd graceful graph. In this paper, the edge odd gracefulness of paths p1, p2, p3,..., ...

Correctly Rounded Binary-Decimal and Decimal-Binary Conversions

This note discusses the main issues in performing correctly rounded decimal-to-binary and binary-to-decimal conversions. It reviews recent work by Clinger and by Steele and White on these conversions and describes some efficiency enhancements. Computational experience with several kinds of arithmetic suggests that the average computational cost for correct rounding can be small for typical conv...

Graceful Tree Labeling

Binary-coded Decimal (bcd)

In computing and electronic systems, binary-coded decimal (BCD) is an encoding for decimal numbers in which each digit is represented by its own binary sequence. Its main virtue is that it allows easy conversion to decimal digits for printing or display and faster decimal calculations. Its drawbacks are the increased complexity of circuits needed to implement mathematical operations and a relat...

On edge graceful labelings of disjoint unions of 2r-regular edge graceful graphs

We prove that if G is a 2r-regular edge graceful (p, q) graph with (r, kp) = 1 then kG is edge graceful for odd k. We also prove that for certain specific classes of 2r-regular edge graceful graphs it is possible to drop the requirement that (r, kp) = 1